Landmark-Based Robot Motion Planning
نویسندگان
چکیده
This paper describes a reduced version of the general motion planning problem in the presence of uncertainty and a complete polynomial algorithm solving it. This algorithm computes a guaranteed plan by backchaining non-directional preimages of the goal until one fully contains the set of possible initial positions of the robot. It assumes that landmarks are scattered across the workspace, that robot control and sensing are perfect within the fields of influence of these landmarks, and that control is imperfect and sensing null outside these fields. The satisfaction of these assumptions may require the robot and/or its workspace to be specifically engineered. This leads us to view robot/workspace engineering as a means to make planning problems tractable. The algorithm was implemented in an operational planner and run on many examples. Non-implemented extensions of the planner are also discussed.
منابع مشابه
A General Framework for Planning Landmark-Based Motions for Mobile Robots
Our work is focused on defining a generic approach for planning landmark based motion. The proposed geometric approach deals with robots of complex kinematic moving in cluttered environment. It aims at providing safe strategy of motion for such constrained conditions. The method consists in selecting automatically the most relevant landmarks along a pre-planned geometric path. It proposes a str...
متن کاملA Landmark-based Motion Planner for Rough Terrain Navigation
In this paper we describe a motion planner for a mobile robot on a natural terrain. This planner takes into account placement constraints of the robot on the terrain and landmark visibility. It is based on a two-step approach: during the rst step, a global graph of subgoals is generated in order to guide the robot through the landmark visibility regions; the second step consists in planning loc...
متن کاملMobile Robot Online Motion Planning Using Generalized Voronoi Graphs
In this paper, a new online robot motion planner is developed for systematically exploring unknown environ¬ments by intelligent mobile robots in real-time applications. The algorithm takes advantage of sensory data to find an obstacle-free start-to-goal path. It does so by online calculation of the Generalized Voronoi Graph (GVG) of the free space, and utilizing a combination of depth-first an...
متن کاملRobust motion planning for rough terrain navigation
This paper deals with motion planning for a mobile robot on rough terrain. We proposed in 9] a geometrical planner for articulated robots which can take into account uncertainty on the terrain and on the position of the robot. This paper aims at improving the robustness of the trajectory using landmark based approach. We consider regions of the terrain where natural landmarks are visible. We pr...
متن کاملVisual Avoidance of Moving Obstacles Based on Vector Field Disturbances
In this paper, we propose a new method for real time obstacle avoidance using visual information. It is based on our on-going research on vector fields and potential functions associated to successful motion planning algorithms. Specifically, this paper addresses the avoidance of dynamic obstacles, which have the property of producing instabilities in the navigation vector field associated to a...
متن کاملPlanning Robot Motion in a 2-D Region with Unknown Obstacles
The purpose of this paper is to present several algorithms for planning the motion of a robot in a two-dimensional region having obstacles whose shapes and locations are unknown. The convergence and efficiency of the algorithms are discussed and upper bounds for the lengths of paths generated by the different algorithms are derived and compared.
متن کامل